SELF-STABILIZING COMPUTATION OF 3-EDGE-CONNECTED COMPONENTS
نویسندگان
چکیده
منابع مشابه
Self-Stabilizing Computation of 3-Edge-Connected Components
A self-stabilizing algorithm is a distributed algorithm that can start from any initial (legitimate or illegitimate) state and eventually converge to a legitimate state in finite time without being assisted by any external agent. In this paper, we propose a selfstabilizing algorithm for finding the 3-edge-connected components of an asynchronous distributed computer network. The algorithm stabil...
متن کاملMaintenance of 2- and 3-connected components of graphs; Part I: 2- and 3-edge-connected components
In this paper a data structure is presented to efficiently maintain the 2and 3-edge-connected components of a graph, under insertions of edges in the graph. Starting from an "empty" graph of n nodes, the insertion of e edges takes O( n log n + e) time in total. The data structure a.llows for insertions of nodes a.lso (in the same time bounds, taking n as the fina.l number of nodes). Moreover, a...
متن کاملSufficient conditions for maximally edge-connected and super-edge-connected
Let $G$ be a connected graph with minimum degree $delta$ and edge-connectivity $lambda$. A graph ismaximally edge-connected if $lambda=delta$, and it is super-edge-connected if every minimum edge-cut istrivial; that is, if every minimum edge-cut consists of edges incident with a vertex of minimum degree.In this paper, we show that a connected graph or a connected triangle-free graph is maximall...
متن کاملA Self-stabilizing Algorithm For 3-Edge-Connectivity
Self-stabilization is a theoretical framework for fault-tolerance without external assistance. Adoption of self-stabilization in distributed systems has received considerable research interest over the last decade. In this paper, we propose a self-stabilizing algorithm for 3-edgeconnectivity of an asynchronous distributed model of computation. A self-stabilizing depth-first search algorithm is ...
متن کاملSelf-stabilizing Numerical Iterative Computation
Many challenging tasks in sensor networks, including sensor calibration, ranking of nodes, monitoring, event region detection, collaborative filtering, collaborative signal processing, etc., can be formulated as a problem of solving a linear system of equations. Several recent works propose different distributed algorithms for solving these problems, usually by using linear iterative numerical ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Foundations of Computer Science
سال: 2011
ISSN: 0129-0541,1793-6373
DOI: 10.1142/s0129054111008623